{"id":"W193394673","doi":"10.5220/0001336100610068","title":"ON DIGITAL SEARCH TREES - A Simple Method for Constructing Balanced Binary Trees","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary search tree; Simple (philosophy); Ternary search tree; Computer science; Optimal binary search tree; Weight-balanced tree; Binary tree; Binary number; Random binary tree; Theoretical computer science; Algorithm; Mathematics; Arithmetic; K-ary tree; Tree structure; Interval tree","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578767,0.0007675831,0.001094306,0.003845971,0.001309762,0.002471818,0.001508557,0.0009360513,0.01111999],"category_scores_gemma":[0.01147538,0.000718374,0.0009772144,0.006280202,0.001113284,0.005516986,0.002660803,0.00156347,0.003698972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001102266,"about_ca_system_score_gemma":0.00147123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002161076,"about_ca_topic_score_gemma":0.004184765,"domain_scores_codex":[0.9982257,0.0003252302,0.0001720536,0.0002711627,0.0008633794,0.0001424347],"domain_scores_gemma":[0.9965145,0.001576055,0.000159091,0.0008635647,0.0007417661,0.0001450398],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002518343,0.0001007373,0.000965003,0.0003709502,0.00004304742,0.00009580537,0.0003226568,0.02039901,0.01089863,0.1740572,0.02069536,0.7717997],"study_design_scores_gemma":[0.0002074866,0.0001551176,0.0009346958,0.0001959254,0.0001277631,0.0006374472,0.0002540529,0.324094,0.02096504,0.5407323,0.1116007,0.00009550677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004824507,0.0003488323,0.9878033,0.0001848096,0.0001002108,0.0001968149,0.0006009067,0.001460752,0.004479975],"genre_scores_gemma":[0.04697391,0.000559103,0.9442921,0.0001605324,0.0001168751,0.0003629295,0.001648412,0.0005723041,0.0053137],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01111999,"threshold_uncertainty_score":0.03720009,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02787745641179899,"score_gpt":0.3328123971783863,"score_spread":0.3049349407665873,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}