am1996 / binary_trees Goto Github PK

0x1D. C - Binary trees 000 00 0 00 00 0/0|0 ()|/ @, 00 0/(/0/0||/0 //)0/0 0() 0/0|()|/0/ '%" 0 () 0_00\ |0 |00/0__%/0 00 00 00 0 0| 0| /0 0 % ()0 /00 ()0---()0\0|00-00--%---()~ 00 ||| ||| ||| ||| , -=-~ .-^- _ ` Learning Objectives General What is a binary tree What is the difference between a binary tree and a Binary Search Tree What is the possible gain in terms of time complexity compared to linked lists What are the depth, the height, the size of a binary tree What are the different traversal methods to go through a binary tree What is a complete, a full, a perfect, a balanced binary tree Environment C programming language C programming language C programming language

Language: C OS: Ubuntu 20.04 LTS Editor: VIM 8.1.2269 Compiler: gcc 9.3.0 compilation flags: -Wall -Werror -Wextra -pedantic -std=gnu89 Style guidelines: Betty style Basic binary tree

/**

• struct binary_tree_s - Binary tree node
• @n: Integer stored in the node
• @parent: Pointer to the parent node
• @left: Pointer to the left child node
• @right: Pointer to the right child node */ struct binary_tree_s { int n; struct binary_tree_s *parent; struct binary_tree_s *left; struct binary_tree_s *right; };

typedef struct binary_tree_s binary_tree_t; Autor Ahmed Magdy