-–
title: ‘Data Struct: Binary Heap’
date: 2025-10-30 15:21:01
tags:
-–
Binary Heap & Binary Search Tree
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29
| struct bst{ bst* left; bst* right; int value; int cnt; } void del(); void new_tree(); void query(); void push(int value, bst* tree){ if(value==tree.value){ tree->cnt++; return; } if(value>tree.value){ if(tree->right!=nullptr){ push(value, tree->right); }else{ tree->right=new_tree(value); } }else{ if(tree->left!=nullptr){ push(value, tree->left); }else{ tree->left=new_tree(value); } } }
|