B Tree
Detailed guide and Python implementation for the 'B Tree' problem.
Problem Statement
Write a function is_valid_btree_leaf_depth(keys, child_pointers, t) that checks if a B-Tree structure node properties are valid. Specifically, return True if all leaf nodes are at the same depth and every node (except root) has between t-1 and 2t-1 keys, where t is the minimum degree. Input format: keys mapping node ID to list of keys, child_pointers mapping node ID to list of child IDs, and minimum degree t.
- •2 <= t <= 10
- •1 <= len(keys) <= 100
Examples
keys = {1: [10, 20], 2: [5], 3: [15], 4: [25, 30]}, child_pointers = {1: [2, 3, 4]}, t = 2True
Root 1 has keys [10, 20]. Children 2, 3, 4 are leaves at the same depth 1 and satisfy the key count constraint of 1 to 3 keys.
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Variables & Data Types Explained
Understand Python variables and core data types (strings, integers, floats, booleans). A complete beginner guide to memory assignment in Python.
How to Generate Random Numbers in Python
Learn how to generate random numbers in Python. Compare randrange, randint, and uniform float generation with seeding control.
Python Built-in Functions
Reference guide to Python's built-in functions. Learn how to use print, len, range, enumerate, zip, map, filter, and more.
Python vs Ruby: Scripting, Web Frameworks, and Philosophy
Compare Python and Ruby. Learn the subtle differences in their philosophies, syntax elegancy, web frameworks (Django vs Rails), and execution styles.