Problem statement :- Implement Max and Min heap. Display elements in Ascending and Descending order. i.e: Max heap will display elements in Descending order and Min heap display elements in Ascending order. A min-heap is a binary tree such that - 1…
- Home
- Interview
- _Java Questions
- _Python
- __Python Questions
- _Data Structure
- __Array
- __Stack & Queue
- __Tree
- __LinkedList
- _Interview Experience
- Big Data
- _MapReduce
- _Apache Hive
- _Apache Hadoop
- __Hadoop Interview
- _Apache Drill
- _Apache Spark
- _Apache Kafka
- Database
- _PL/SQL
- _Cassandra
- _ElasticSearch
- _Data Security
- Cloud Tech
- _Google Cloud (GCP)
- _Kubernetes
- ML & AI
- _Azure ML
- _Data Analytics
- __Tableau
- Supply Chain