K5kC | Code & More

Computer Science

Algorithms Java Programming Languages Database System Design

Blind 75 Algo Kernel Difficulty: Easy Difficulty: Medium Difficulty: Hard

Android Data Science Computer Vision Simulations

UUID Generator Code Formatter

Algorithms Fundamentals

Overview Tree Glossary Tree Properties Tree ADT Height and Depth of a Node in Tree Height of a Tree Definition Binary Tree Binary Tree Types Full Binary Tree Perfect Binary Tree Complete Binary Tree Complete vs. Full Binary Tree Complete Binary Tree Array Representation Degenerate (Pathological) Binary Tree Skewed Binary Tree Binary Tree Representation Binary Tree ADT and Operations Binary Tree Implementation Binary Tree Traversals Binary Tree DFS Traversal Inorder Predecessor and Successor Binary Search Tree BST Operations BST Traversal BST Simple Implementation BST Generic Implementation Threaded Binary Tree Single vs. Double Threaded Single Threaded Binary Tree Double Threaded Binary Tree N-ary Tree N-ary Tree Representation Complete N-ary Tree Perfect N-ary Tree Perfect N-ary Tree — Size Trie Trie Representation Array Based TrieNode Representation Using Set or List Based TrieNode Representation Map Based TrieNode Representation with Whole String Generics Based TrieNode Representation Trie Operations Trie Operations - Insertion Trie Operations - Search OR Exists Trie Operations - Delete Trie Operations Complexity Trie Variations Compressed Trie Tree OR Radix Tree OR Patricia Tree Compressed Trie Tree Example KD Tree Binomial Tree Expression Tree

Classifying Algorithms

Iterative VS recursive algorithms

Serial, Parallel, and Distributed Algorithms

Computer Science

Algorithms Fundamentals

Inorder Predecessor and Successor

Inorder Predecessor and Successor

← PreviousBinary Tree DFS Traversal Next →Binary Search Tree

Privacy Disclaimer Report an Issue About

© 2026 K5kC | Code & More. All rights reserved.

चरैवेति चरैवेति | Keep moving on